We prove, in ZFC,the existence of a definable, countably saturated elementary extension of the reals.

We prove that in the Solovay model, every OD equivalence relation, E, over the reals, either admits an OD reduction to the equality relation on the set of all countable (of length $ ) binary sequences, or continuously embeds E 0 , the Vitali equivalence. If E is a Σ 1 1 (resp. Σ 1 2 ) relation then the reduction above can be chosen in the class of all ▵ 1 (resp. ▵ 2 ) functions. The proofs are based (...) on a topology generated by OD sets. (shrink)

Russian Orthodoxy during the twentieth century presented a rich and varied body of thought about the nature of humanity and the human condition. This article surveys the major thinkers within this tradition, beginning with its background in the Slavophile movement and culminating in the work of more recent Orthodox thinkers such as Sergei Bulgakov, Georges Florovsky, Vladimir Lossky, and Alexander Schmemann.

“Toy worlds” involving actions, such as the blocks world and the Missionaries and Cannibals puzzle, are often used by researchers in the areas of commonsense reasoning and planning to illustrate and test their ideas. We would like to create a database of generalpurpose knowledge about actions that encodes common features of many action domains of this kind, in the same way as abstract algebra and topology represent common features of specific number systems. This paper is a report on the first (...) stage of this project—the design of an action description language in which this database will be written. The new language is an extension of the action language C+. Its main distinctive feature is the possibility of referring to other action descriptions in the definition of a new action domain. (shrink)

In this paper we summarise the constraints that low-redshift data—such as supernovae Ia, baryon acoustic oscillations and cosmic chronometers —are able to set on the concordance model and its extensions, as well as on inhomogeneous but isotropic models. We provide a broad overlook into these cosmological scenarios and several aspects of data analysis. In particular, we review a number of systematic issues of SN Ia analysis that include magnitude correction techniques, selection bias and their influence on the inferred cosmological constraints. (...) Furthermore, we examine the isotropic and anisotropic components of the BAO data and their individual relevance for cosmological model-fitting. We extend the discussion presented in earlier works regarding the inferred dynamics of cosmic expansion and its present rate from the low-redshift data. Specifically, we discuss the cosmological constraints on the accelerated expansion and related model-selections. In addition, we extensively talk about the Hubble constant problem, then focus on the low-redshift data constraint on \ that is based on CC. Finally, we present the way in which this result compares to the high-redshift \ estimate and local measurements that are in tension. (shrink)

The author examines the key philosophical problem of theodicy and freedom as it was first formulated by Fyodor Dostoevsky and later developed by Nikolai Berdyaev.

We consider games over a finite alphabet with Gurevich-Harrington's winning conditions and restraints as in Yakhnis-Yakhnis . The game tree, the Gurevich-Harrington's kernels of the winning condition and the restraints are defined by finite automata. We give an effective criterion to determine the winning player and an effective presentation of a class of finite automata defined winning strategies.Our approach yields an alternative solution to the games considered by Büchi and Landweber . The BL algorithm is an important tool for solving (...) effectively presented games. The differences between the BL and our algorithms are as follows. Our algorithm is uniformly applicable to winning sets that correspond to boolean combinations of BL winning conditions, while the BL algorithm requires a transformation of such boolean combinations into a single BL condition. Our algorithm directly applies to a larger class of game trees for a given game alphabet than does the BL one. We describe Büchi-Landweber's class of winning conditions in a more transparent way by using finite automata and Gurevich-Harrington's form of winning conditions. Our algorithms that determine the winner of the game and find a winning strategy, are based on a translation of the events in the game in terms of the transition table of the automaton representing the game. This automaton differs from the ones that represent BL winning conditions. Both algorithms need further investigation.The algorithm determining the winner in the game, can be used as a verifier of concurrent programs. This is because programs can be viewed as strategies in Gurevich-Harrington's games and program specifications could be regarded as winning conditions for such games. The algorithm which finds a winning strategy could be used as a basis for automated concurrent program design.The present paper is a sequel to Annals of Pure and Applied Logic 48 277–297. (shrink)

This study focuses on determining whether violent contexts influence the perception of aggressiveness in faces analysing spontaneous corrugator supercilii activity. Participants viewed pictures of...

As variants of the Christian tradition have emerged through the centuries they have given rise to distinct versions of Christian metaphysics with divergent cosmological commitments. In the early Church, the Cappodocian fathers constructed a theological framework which focuses on the “personal” nature of reality. The personal nature of reality is central not only to understanding key theological doctrines, such as the Trinity, but also the cosmos itself. This essay explores the Cappodocian conception of the cosmos as personal both in its (...) origin and as a medium for an interpersonal relationship between God and creatures. (shrink)

We consider QED processes in the presence of an infinitely thin and infinitely long straight string with a magnetic flux inside it. The bremsstrahlung from an electron passing by the magnetic string and the electron-positron pair production by a single photon are reviewed. Based on the exact electron and positron solutions of the Dirac equation in the external Aharonov-Bohm potential we present matrix elements for these processes. The dependence of the resulting cross sections on energies, directions, and polarizations of the (...) involved particles is discussed for low energies. (shrink)

En el presente escrito se intentará mostrar algunos desafíos que el mundo contemporáneo pone a la educación bajo el influjo de la globalización, procesos que afectan muchos ámbitos del pensar y del actuar humano. Expone una serie de conceptualizaciones sobre dicho tema e invita al análisis serio de ese fenómeno por sus implicaciones sociales.

This paper is motivated by the idea of interaction between two directions of research in knowledge representation: the design of action description languages and the development of libraries of reusable, general-purpose knowledge components. Writing an action description that characterizes actions in terms of their effects, as common today, can be compared to writing a program that does not use standard subroutines. We conjecture that a library of standard descriptions for a number of “basic” actions can facilitate writing, understanding and modifying (...) action descriptions. In this paper, we take some steps towards determining how such a library, written in the action language C+, can be used. When using an instance of a library action description, we relate the library constants to the domain-specific constants by providing definitions. Therefore, a theory of explicit definitions in C+ is developed. To illustrate the use of the library, we show how the action PushBox in the Monkey and Bananas domain can be described as a special case of the “library action” Move. (shrink)

The language of nonmonotonic causal theories, defined by Norman McCain and Hudson Turner, is an important formalism for representing properties of actions. For causal theories of a special kind, called definite, a simple translation into the language of logic programs under the answer set semantics is available. In this paper we define a similar translation for causal theories of a more general form, called al-.

In “Elementa Juris Naturalis” (1671) G.W. Leibniz formulated the genius intuition about the fundamental unity of juridical and Aristotelian modalities. Interpreting and explicating this intuition by virtue of the deontic logic G.W. Wright arrived to the conclusion that the unity of modalities in question is not an equivalence relation but an analogy one. However a complement for G.W. Wright’s explication of the intuition of G.W. Leibniz was submitted. This complement was a two-valued algebra of formal-natural-law philosophy of juridical and Aristotelian (...) modalities as moral-legal evaluation-functions determined by one variable. In thepresent paper I submit a binary generalization of the mentioned unary complement. By virtue of this generalization some significant shortcomings of the complement in question are eliminated. The generalization deals with the modalities as moral-legal evaluation-functions determined by two variables. (shrink)

The article deals with the actual problems of training specialists in the field of cults and arts for professional activity in the conditions of the rule of law; the issues of students 'professionalism are considered, which cannot be limited only by the level of narrowly focused training, but should include legal competence, which implies the formation of students' ability to carry out independent search, critical analysis, generalization of information, determination of their own position, critically comprehend and generalize the information received, (...) analyze socially and personally significant problems in the context of the rule of law, they should know legal documents, directions of cultural protection activities, to have the necessary amount of legal knowledge; the necessity of introducing the course "Protection of Intellectual property" into the educational process of universities of culture and arts, focused on understanding the issues of creating and using objects of copyright and related rights; the objectives of the course should be the development of an understanding of copyright and related rights, the rules for the protection of copyright and related rights, the study of the main trends of law enforcement practice in the field of copyright and rights related to copyright, the study of documents regulating copyright, etc. (shrink)

The travelling salesman problem (TSP) belongs to the class of NP-hard problems, in which an optimal solution to the problem cannot be obtained within a reasonable computational time for large-sized problems. To address TSP, we propose a hybrid algorithm, called GA-TCTIA-LBSA, in which a genetic algorithm (GA), tour construction and tour improvement algorithms (TCTIAs) and a list-based simulated annealing (LBSA) algorithm are used. The TCTIAs are introduced to generate a first population, and after that, a search is continued with the (...) GA. The problem of premature convergence of the GA to local optimum is tackled by a method called social disaster technique. Afterwards, the LBSA is applied to generate a new population based on one of two proposed operators called packing and judgement day. The proposed algorithm is implemented in the MATLAB environment, and its two variants, called GA-TCTIA-LBSA packing and GA-TCTIA-LBSA judgement day, are tested on symmetric and asymmetric instances from TSPLIB. The overall results demonstrate that the proposed GA-TCTIA-LBSAs offer promising results, particularly for small-sized instances. (shrink)